Path Counting for Grid-Based Navigation

نویسندگان

چکیده

Counting the number of shortest paths on a grid is simple procedure with close ties to Pascal’s triangle. We show how path counting can be used select relatively direct for AI-related applications involving navigation through spatial environments. Typical implementations Dijkstra’s algorithm and A* prioritize moves in an arbitrary manner, producing which stray conspicuously far from line-of-sight trajectories. find that by traverse each vertex, then selecting vertices highest counts, one obtains reasonably practice improved refining resolution. Central Dijkstra are introduced as basic methods computing these central paths. Theoretical analysis reveals proposed grid-based approach related existing visibility approach, establishes converge clear sightlines spacing approaches zero. A more general property, paths, formulated conjecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grid-Based Navigation for Autonomous, Mobile Robots

Navigation is a major challenge for autonomous, mobile robots. The problem can basically be divided into positioning and path planning. In this paper we present an approach which we call grid-based navigation. Though we also propose a scheme for path finding, we focus on positioning. Our approach uses minimal environmental infrastructure and only two light sensors on the mobile device itself. S...

متن کامل

Speech-Based Navigation: Improving Grid-Based Solutions

Speech-based technology is a useful alternative to traditional input techniques such as the keyboard and mouse. For people with disabilities that hinder use of traditional input devices, a hands-free speech-based interaction solution is highly desirable. Various speech-based navigation techniques have been discussed in the literature and employed in commercial software applications. Among them,...

متن کامل

Counting Cells in a Grid. Counting Cells in a Grid

The goal of this paper is to estimate in a theoretical way the reduction of the number of cells of, and the overall number of neighbouring cells in, a grid when some cells in a uniform grid are replaced by a larger cell in an overlaying non-uniform grid. We assume that the grids are represented by a 2 k-tree and the replacement of cells preserves the representation.

متن کامل

Recommender Systems Based on Navigation Path Features

Several kinds of features of user navigation paths (e.g., subsets of the resources as nodes of the paths covered, subsequences of the sequences used for path description, path fragments constructed via combination of subsequences and wildcards) can be employed to build recommender systems designed for tasks as di erent as site personalization, cross-/up-selling, and navigation assistance. A voc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Artificial Intelligence Research

سال: 2022

ISSN: ['1076-9757', '1943-5037']

DOI: https://doi.org/10.1613/jair.1.13544